Optimum Routing in the Urban Transportation Network by Integrating Genetic Meta-heuristic (GA) and Tabu Search (Ts) Algorithms

نویسندگان

چکیده مقاله:

Urban transportation is one of the most important issues of urban life especially in big cities. Urban development, and subsequently the increase of routes and communications, make the role of transportation science more pronounced. The shortest path problem in a network is one of the most basic network analysis issues. In fact, finding answers to this question is necessity for higher level analysis. In general, shortest path solution methods using optimization algorithms are divided into two categories: exact and approximate algorithms. In exact algorithms, achieving the optimal solution requires time, and consequently more cost. On the opposite side, there are some approximate algorithms that work in a short period of time. Meta-heuristic algorithms are among approximate algorithms that are capable of finding optimal or near-optimal solutions in a reasonable period of time. The method used in this study is to solve the shortest path problem with the combination of Genetic meta-heuristic (GA) and Tabu Search (TS) algorithms. GA is inspired by genetic science and Darwin's theory of evolution; it is based on survival of the highest or natural selection. A common use of genetic algorithms is to be used as an optimization function. In GA, the genetic evolution of living things of life is simulated. Inspired by the evolutionary process of nature, these algorithms solve problems. GA forms a set of population (solutions), then it achieves an optimal set by acting some possess on the correct set. To solve a problem by genetic algorithms, it is necessary the problem is converted to the specific form required by GA. On the other hand, TS algorithm is not population-based. It obtains an answer, then it tries to direct the answer to the optimal solution by applying a series of operators. This algorithm is highly similar to the Simulated Annealing algorithm. In this paper, for solving the shortest path problem, a series of geometric pre-processing on the network is done to generate a search area around the source and destination nodes. In the proposed algorithm, the cost function is defined as a complex number, which the real part shows the sum of the weight of the real edges, and the imaginary part denotes the number of virtual edges. The innovation of this research is about applying Tabu Search algorithm in mutations process of genetic algorithm. The proposed method overcomes the inappropriate response of the pure genetic algorithm in terms of the final weight of the path especially the large networks. In order to evaluate the efficiency of the proposed algorithm, the algorithm was implemented on a real directional network which is part of Tehran city road networks including 739 nodes and 1160 edges. The results show that in the proposed algorithm, the length of the path is as close as possible to the solution obtained from the definitive Dijkstra’s algorithm. This algorithm predicts approximately the final path length of 5% more than Dijkstra’s algorithm. But in terms of running speed, it is 5.12 times faster than the Dijkstra’s algorithm. In comparison with the pure genetic algorithm, the proposed algorithm is 9% shorter in average in terms of path length. And about the running time, the speed of the proposed algorithm is approximately equal to the pure genetic algorithm. Regarding to repeatability, the proposed algorithm also shows 25.36% of repeatability.  

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling

The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...

متن کامل

Routing foreseeable lightpath demands using a tabu search meta-heuristic

In this paper we investigate the problem of routing a set of lightpath demands for which the set-up and tear-down dates are known. We call this type of requests Foreseeable Lightpath Demands or FLDs. In a transport network, FLDs correspond, for example, to clients’ requests for pre-provisioned bandwidth capacity such as fixed-bandwidth pipes for bulk data transfers during the night, extra VPN b...

متن کامل

Integrating genetic algorithms and tabu search for unit commitment problem

Optimization is the art of obtaining optimum result under given circumstances. In design, construction and maintenance of any engineering system, Engineers have to take many technological and managerial decisions at several stages. The ultimate goal of all such decisions is to either maximize the desired benefit or to minimize the effort or the cost required. This paper shows a memetic algorith...

متن کامل

Designing Incomplete Hub Location-routing Network in Urban Transportation Problem

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

متن کامل

A Tabu Search Heuristic for the Inland Container Transportation Problem

The Inland Container Transportation Problem describes the movement of full and empty containers among a number of terminals, depots and customers in a hinterland region. A trucking company with a homogeneous fleet of trucks has to serve customers which either receive goods by inbound containers or ship goods by outbound containers. While keeping given hard time constraints the total operating t...

متن کامل

comparison of simulated annealing, genetic, and tabu search algorithms for fracture network modeling

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the object...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 9  شماره 3

صفحات  145- 158

تاریخ انتشار 2020-02

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

کلمات کلیدی برای این مقاله ارائه نشده است

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023